An Algorithm for Hinge Vertex Problem on Circular Trapezoid Graphs
نویسندگان
چکیده
منابع مشابه
Efficient algorithm for the vertex connectivity of trapezoid graphs
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing problems in VLSI design and identifying the optimal chain of non-overlapping fragments in bioinformatics. Using modified binary indexed tree data structure, we de...
متن کاملCircular and Circle Trapezoid Graphs
Along with the direction that generalizes interval graphs and permutation graphs to trapezoid graphs, researchers are now trying to generalize the class known as trapezoid graphs. A circle trapezoid is the region in a circle that lies between two non-crossing chords; thus, circle trapezoid graphs are the intersecting graphs of circle trapezoids within a circle. It should be noted that circle tr...
متن کاملAn Optimal Sequential Algorithm to Compute All Hinge Vertices on Circular-Arc Graphs
The distance between at least two vertices of a network becomes longer after the removal of a hinge vertex. Thus a faulty hinge vertex will increase the overall communication cost in a network. Therefore, finding the set of all hinge vertices in a graph can be used to identify the critical nodes in a real network. In this paper, an algorithm is presented to find hinge vertices of a circular-arc...
متن کاملOn vertex covers and matching number of trapezoid graphs
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of minimum vertex covers (or independent sets), as well as the total number of vertex covers, and reduce the time complexity from O(n) to O(n log n), where n is the...
متن کاملAn Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph
The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomial-time algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2017
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.25.945